Privacy-preserving Ontology Matching

نویسندگان

  • Prasenjit Mitra
  • Peng Liu
  • Chi-Chun Pan
چکیده

Increasingly, there is a recognized need for secure information sharing. In order to implement information sharing between diverse organizations, we need privacypreserving interoperation systems. In this work, we describe two frameworks for privacy-preserving interoperation systems. Ontology matching is an indispensable component of interoperation systems. To implement privacy-preserving interoperation systems, we need privacy-preserving ontology matching algorithms. In this paper, we outline frameworks for privacy-preserving ontology matching and discuss the privacy implications of the frameworks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy-Preserving Schema Matching Using Mutual Information

The problem of schema or ontology matching is to define mappings among schema or ontology elements. Such mappings are typically defined between two schemas or two ontologies at a time. Ideally, using the defined mappings, one would be able to issue a single query that will be rewritten automatically to all the databases, instead of manually writing a query to each database. In a centrally media...

متن کامل

Privacy-Preserving Matching Protocols for Attributes and Strings

In this technical report we present two new privacy-preserving matching protocols for singular attributes and strings, respectively. The first one is used for matching of common attributes without revealing unmatched ones to each other. The second protocol is used to discover the longest common sub-string of two input strings in a privacy-preserving manner. Compared with previous work, our solu...

متن کامل

Privacy Preserving Modules for Ontologies

Data privacy is an important application of ontology modularization. The aim is to publish one module while keeping the information of another module private. We show how locality and partitioning two basic concepts in the theory of modular ontologies naturally lead to privacy preserving query answering over modular ontologies.

متن کامل

Erratum: “Customisation of Paillier Homomorphic Encryption for Efficient Binary Biometric Feature Vector Matching” does NOT enable Privacy-Preserving Matching

A privacy-preserving biometric matching technique for binary vectors more efficient than the Goldwasser-Micali approach has been proposed in “Customisation of Paillier Homomorphic Encryption for Efficient Binary Biometric Feature Vector Matching [PPRU14]” based on exploiting Paillier’s capability of encrypting messages larger than one bit at a time. We demonstrate that the suggested solution do...

متن کامل

Privacy-Preserving Reasoning for Hypergraphical Knowledge Bases

Many semantic web applications require selective sharing of ontologies between autonomous entities due to copyright, privacy or security concerns. In our previous work it was shown that, on such occasions, an agent who wishes to hide part of its ontology while sharing the rest may still be able to answer safely queries against its knowledge base using inferences based on both hidden and visible...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005